1674A - Number Transformation - CodeForces Solution

#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);  
#define ll long long  
#define dv vector<ll> 
#define dvp vector<pair<ll,ll>>  
#define loop(n) for (ll i = 0; i < n; i++) 
#define input(n,v) loop(n) { ll in; cin >> in; v.push_back(in);}  
#define inputvp(n,v) loop(n) {ll x,y; cin>>x>>y; v.push_back(make_pair(x,y));} 
#define all(v) v.begin(), v.end() 
#define sz(s) s.size()  
#define chk(v) for (auto& i : v)cout << i <<" "; cout<<"\n"
#define dm map<ll,ll>
#define ds set<ll>
#define fi first
#define se second 
using namespace std;
int main()
{
    fast;
    ll t = 0; cin >> t;
    while (t--)
    {
        ll x = 0, y = 0; cin >> x >> y;
        if ((y / x) * x == y)cout << 1 << " " << y / x << "\n";
        else cout << "0 0\n";


    }


}